利用遗传算法求解整周模糊度

建立了一种基于简单遗传算法的改进模糊度搜索方法求解载波相位测量中的整周模糊度。首先采用UDUT 和LDLT 分解对整周模糊度进行整数高斯变换以降低各整周模糊度之间的相关性 ,然后利用遗传算法进行整周模糊度搜索。在种群个体较少的情况下 ,为了避免早熟使搜索陷入局部最优 ,提出两种变异算子 ,保持个体的多样性。仿真结果表明改进后的算法较使用简单遗传算法具有更快的搜索速度和鲁棒性。     

利用几何约束快速求解整周模糊度

以GPS载波相位测量来确定载体姿态为背景 ,针对其中的关键技术问题———载波相位整周模糊度的快速解算 ,提出了一种充分利用卫星与基线之间几何约束来压缩搜索空间 ,快速得到正确的双差模糊度组合的方法 ,并通过对ADUⅡ接收机采集的原始数据进行处理 ,其结果证明这是一种行之有效的模糊度搜索方法。     

整数变换及其在H.263中的应用

针对H.263视频编码标准的DCT变换有运算量大、截尾误差等特点,在提升格式的基础上,采用整数变换代替浮点DCT,并且对相应的量化器加以调整,设计了一种适宜于H.263的整数变换。并将这种整数DCT、浮点DCT和定点DCT在结构和性能上进行比较分析,证实其具有消除浮点运算、减少运算量的特点,并且有很好的压缩效果。     

捷联干涉仪体制被动导引头测角解模糊算法

首先阐述了捷联干涉仪体制被动导引头测角模糊现象出现的机理,并分别针对导引头处于目标截获和目标跟踪2种状态下鉴相模糊现象作了分析。在此基础上,提出了目标截获和目标跟踪2种状态下导引头测角解模糊算法,算法基于地面站实时给导弹粗装订的弹目相对方位角数据。最后,给出了目标截获时角度容限及目标跟踪时相位容限的确定方法。     

Radar pulse interleaving for multi‐target tracking

In a multifunction radar, the maximum number of targets that can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead‐times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the capacity of the system. The problem of interleaving N targets involves a search among N! possibilities, and suboptimal solutions are usually employed to satisfy the real‐time constraints of the radar system. In this paper, we present new tight 0–1 integer programming models for the radar pulse interleaving problem and develop effective solution methods based on Lagrangian relaxation techniques. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

脉冲群间多普勒频率变化率的高精度测量算法

提出了一种脉冲群间多普勒频率变化率的高精度测量算法,该算法利用脉冲群内相邻脉冲对间的互相关函数估计脉冲群模糊频率,在连续脉冲群间选择任一相同模糊频率进行解模糊得到各脉冲群相对频率,由于这些相对频率包含相同的模糊,从而可以利用差分或滤波算法得到脉冲群间多普勒频率变化率。该算法具有相对频率估计精度高、解模糊过程简单、运算量小、多普勒频率变化率测量精度高等优点。计算机仿真和地面缩比试验均证明了该测量算法的有效性。     

Models and algorithms for shuffling problems in steel plants

In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

模拟电路中非零交叉情况下故障最小范围的确定方法

为确定模拟电路非零交叉情况下故障元件存在范围,提出了一种K故障下诊断的新方法。它是一种确定故障元件存在的最小范围的方法,即在十分现实的K故障下,确定能代表电路所有元件并给出在K故障假设下的最优可测试元件组,使故障定位工作只局限于该组元件。通过可测试值计算和规范式不确定性组与最优可测试成分组的确定,可以诊断故障元件的范围。     

Generalized orienteering problem with resource dependent rewards

We introduce a generalized orienteering problem (OP) where, as usual, a vehicle is routed from a prescribed start node, through a directed network, to a prescribed destination node, collecting rewards at each node visited, to maximize the total reward along the path. In our generalization, transit on arcs in the network and reward collection at nodes both consume a variable amount of the same limited resource. We exploit this resource trade‐off through a specialized branch‐and‐bound algorithm that relies on partial path relaxation problems that often yield tight bounds and lead to substantial pruning in the enumeration tree. We present the smuggler search problem (SSP) as an important real‐world application of our generalized OP. Numerical results show that our algorithm applied to the SSP outperforms standard mixed‐integer nonlinear programming solvers for moderate to large problem instances. We demonstrate model enhancements that allow practitioners to represent realistic search planning scenarios by accounting for multiple heterogeneous searchers and complex smuggler motion. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Single channel source separation of radar fuze mixed signal based on phase difference analysis

A new method based on phase difference analysis is proposed for the single-channel mixed signal separation of single-channel radar fuze. This method is used to estimate the mixing coefficients of de-noised signals through the cumulants of mixed signals, solve the candidate data set by the mixing coefficients and signal analytical form, and resolve the problem of vector ambiguity by analyzing the phase differences. The signal separation is realized by exchanging data of the solutions. The waveform similarity coefficients are calculated, and the time–frequency distributions of separated signals are analyzed. The results show that the proposed method is effective.